Bit and Byte Level Generalized Modified Vernam Cipher Method with Feedback

نویسندگان

  • Prabal Banerjee
  • Asoke Nath
چکیده

In the present paper the authors have introduced a new symmetric key cryptographic method where they have clubbed both bit level and byte level generalized modified vernam cipher method with feedback. Nath et al already developed methods bit level encryption standard(BLES) Ver-I and Ver-II where they have used extensive bit level permutation, bit exchange, bit xor and bit shift encryption method. Nath et al also developed a method bit level generalised vernam cipher method. In the present study the authors have used both bit level generalized vernam cipher method and after that byte level vernam cipher method using feedback. Due to introduction of feedback in both bit level as well as byte level vernam cipher method the common attacks such as differential attack or known plain text attack is not applicable in the present method. In the present paper the authors have used random key generator to construct the keypad for vernam cipher method. The authors have introduced a special bit manipulation method so the encryption algorithm will work even for all characters with ASCII Code 0 or all characters with ASCII Code 255. The most of the standard algorithm will fail to encrypt a file where all characters are ASCII ‘0’ or all characters with ASCII ‘255’ where as the present method will be able to encrypt a file where all characters are ASCII ‘0’ or all characters are ASCII ‘255’. The present method will be effective for encrypting short message, password, confidential key etc. General Terms encryption, bit-level

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SD-AREE-I Cipher: Amalgamation of Bit Manipulation, Modified VERNAM CIPHER & Modified Caesar Cipher (SD-AREE)

This paper presents a new combined symmetric key cryptographic technique, which is generally an amalgamation of Bit Manipulation, generalized Modified Vernam Cipher, Single Bit Manipulation and Modified Caesar Cipher. The technique proposed here is basically an advanced and upgraded module of SD-AREE cryptographic method, which is based on Modified Caesar Cipher along with Bit Manipulation and ...

متن کامل

Symmetric key Cryptography using two-way updated -Generalized Vernam Cipher method: TTSJA algorithm

In the present paper the authors have introduced a new updated two-way generalized vernam cipher method called TTSJA. Chatterjee et. al developed a method [1] where they used three independent methods such as MSA [2], NJJSAA [3] and modified generalized vernam cipher method. Nath et al already developed some symmetric key methods [2,3,4,5] where they have used bit manipulation method and some r...

متن کامل

An Advanced Combined Symmetric Key Cryptographic Method using Bit Manipulation, Bit Reversal, Modified Caesar Cipher (SD-REE), DJSA method, TTJSA method: SJA-I Algorithm

In this paper, the authors propose a new combined symmetric key cryptographic method, SJA-I, which basically has four steps: Firstly, each byte is broken into its equivalent binary format and then single bit manipulation is executed on that; secondly Modified Caesar Cipher technique (SD-REE) and TTJSA cipher algorithm are applied on the data (message) randomly, which depends on the key provided...

متن کامل

An Image Encryption Method: SD-Advanced Image Encryption Standard: SD-AIES

The security of digital information in modern times is one of the most important factors to keep in mind. For this reason, in this paper, the author has proposed a new standard method of image encryption. The proposed method consists of 4 different stages: 1) First, a number is generated from the password and each pixel of the image is converted to its equivalent eight binary number, and in tha...

متن کامل

The communication protocol of pointers to the decrypt engine

This cipher methodology utilizes 4 pointers pseudo-randomly set initially and pseudo-randomly advanced between blocks. These pointers, pointing to unique streams within an 8 Mbyte key, are then Xor’ed together producing an Effective Key Stream (EKS) and then Xor’ed with the plaintext. The fourth pointer is a mathematical construction of 3 byte accesses from each of 3 table accesses Xor’ed with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013